Non-empirical problems in fair machine learning

نویسندگان

چکیده

Abstract The problem of fair machine learning has drawn much attention over the last few years and bulk offered solutions are, in principle, empirical. However, algorithmic fairness also raises important conceptual issues that would fail to be addressed if one relies entirely on empirical considerations. Herein, I will argue current debate developed an framework brought contributions development decision-making, such as new techniques discover prevent discrimination, additional assessment criteria, analyses interaction between predictive accuracy. same suggested higher-order regarding translation into metrics quantifiable trade-offs. Although (empirical) tools which have been so far are essential address discrimination encoded data algorithms, their integration society elicits key (conceptual) questions as: What kind assumptions decisions underlies framework? How do results approach penetrate public debate? reflection deliberation should stakeholders available metrics? outline learning, i.e. how is framed addressed, suggest there non-empirical tackled. While this work focus fairness, lesson can extend other problems analysis decision-making privacy explainability.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The Authority of "Fair" in Machine Learning

In this paper, we argue for the adoption of a normative definition of fairness within the machine learning community. After characterizing this definition, we review the current literature of Fair ML in light of its implications. We end by suggesting ways to incorporate a broader community and generate further debate around how to decide what is fair in ML.

متن کامل

Geometric Problems in Machine Learning

We present some problems with geometric characterizations that arise naturally in practical applications of machine learning. Our motivation comes from a well known machine learning problem, the problem of computing decision trees. Typically one is given a dataset of positive and negative points, and has to compute a decision tree that ts it. The points are in a low dimensional space, and the d...

متن کامل

Differentially Private Algorithms for Empirical Machine Learning

An important use of private data is to build machine learning classifiers. While there is a burgeoning literature on differentially private classification algorithms, we find that they are not practical in real applications due to two reasons. First, existing differentially private classifiers provide poor accuracy on real world datasets. Second, there is no known differentially private algorit...

متن کامل

Missing Data Problems in Machine Learning

Missing Data Problems in Machine Learning Benjamin M. Marlin Doctor of Philosophy Graduate Department of Computer Science University of Toronto 2008 Learning, inference, and prediction in the presence of missing data are pervasive problems in machine learning and statistical data analysis. This thesis focuses on the problems of collaborative prediction with non-random missing data and classific...

متن کامل

The Bitvector Machine: A Fast and Robust Machine Learning Algorithm for Non-linear Problems

In this paper we present and evaluate a simple but effective machine learning algorithm that we call Bitvector Machine: Feature vectors are partitioned along component-wise quantiles and converted into bitvectors that are learned. It is shown that the method is efficient in both training and classification. The effectiveness of the method is analysed theoretically for best and worst-case scenar...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Ethics and Information Technology

سال: 2021

ISSN: ['1388-1957', '1572-8439']

DOI: https://doi.org/10.1007/s10676-021-09608-9